| ISBN: 0-7695-1961-X
|
| |
| description |
Distribution of data in mobile ad hoc networks is challenged when
the mobility of nodes leads to frequent topology changes. Existing
approaches so far address either the network partitioning problem or
are capable of handling large amounts of data, but not both at the
same time. In this paper a novel approach is presented which is
based on a negotiation scheme enhanced by an adaptive repetition
strategy. Different strategies for the selection of repeated data
are presented and evaluated. Simulation results show a reduction of
data transfer volume compared to hyper-flooding by 30 to 40% even in
the presence of frequent network partitions.
|
| publisher |
Los Alamitos: IEEE Computer Society
|
| type |
Text
|
| Article in Proceedings
|
| source |
In: Tantawy, Ahmed (ed.); Inan, Kemal (ed.): Proceedings of the
Eighth IEEE Symposium on Computers and Communications (ISCC 2003).
Vol. I, pp. 633-640
|
| ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2003-06/INPROC-2003-06.pdf
|
| contributor |
IPVS, Verteilte Systeme
|
| format |
application/pdf
|
| 200071 Bytes
|
| subject |
Network Architecture and Design (CR C.2.1)
|
| relation |
IEEE Symposium on Computers and Communications
|